A Robust Logical and Computational Characterisation of Peer-to-Peer Database Systems

In this paper we give a robust logical and computational characterisation of peer-to-peer (p2p) database systems. We first define a precise model-theoretic semantics of a p2p system, which allows for local inconsistency handling. We then characterise the general computational properties for the problem of answering queries to such a p2p system. Finally, we devise tight complexity bounds and distributed procedures for the problem of answering queries in few relevant special cases

ON THE EXPRESSIVE POWER OF INFINITE TEMPORAL DATABASES

We discuss different techniques for representing infinite temporal data. There are two basic approaches: A procedural description, as used in production systems, and represented, in this paper, by a version of Datalog. The second approach is a more declarative method, using some form of temporal logic programming. We examine several versions of each approach, and compare their expressive power, i.e., what temporal data each formalism can capture.Information Systems Working Papers Serie

Natural disasters and indicators of social cohesion

Do adversarial environmental conditions create social cohesion? We provide new answers to this question by exploiting spatial and temporal variation in exposure to earthquakes across Chile. Using a variety of methods and controlling for a number of socio-economic variables, we find that exposure to earthquakes has a positive effect on several indicators of social cohesion. Social cohesion increases after a big earthquake and slowly erodes in periods where environmental conditions are less adverse. Our results contribute to the current debate on whether and how environmental conditions shape formal and informal institutions

Looking through the 'window of opportunity': is there a new paradigm of podiatry care on the horizon in early rheumatoid arthritis?

Over the past decade there have been significant advances in the clinical understanding and care of rheumatoid arthritis (RA). Major paradigm changes include earlier disease detection and introduction of therapy, and 'tight control' of follow-up driven by regular measurement of disease activity parameters. The advent of tumour necrosis factor (TNF) inhibitors and other biologic therapies have further revolutionised care. Low disease state and remission with prevention of joint damage and irreversible disability are achievable therapeutic goals. Consequently new opportunities exist for all health professionals to contribute towards these advances. For podiatrists relevant issues range from greater awareness of current concepts including early referral guidelines through to the application of specialist skills to manage localised, residual disease activity and associated functional impairments. Here we describe a new paradigm of podiatry care in early RA. This is driven by current evidence that indicates that even in low disease activity states destruction of foot joints may be progressive and associated with accumulating disability. The paradigm parallels the medical model comprising early detection, targeted therapy, a new concept of tight control of foot arthritis, and disease monitoring

Generalized XML Security Views

We investigate a generalization of the notion of XML security view introduced by Stoica and Farkas [22] and later refined by Fan et al. [12]. The model consists of access control policies specified over DTDs with XPath expression for data-dependent access control policies. We provide the notion of security views for characterizing information accessible to authorized users. This is a transformed (sanitized) DTD schema that can be used by users for query formulation and optimization. Then we show an algorithm to materialize "authorized" version of the document from the view and an algorithm to construct the view from an access control specification. We show that our view construction combined with materialization produces the same result as the direct application of the DTD access specification on the document. To avoid the overhead of view materialization in query answering, user queries should undergo rewriting so that they are valid over the original DTD schema, and thus the query answer is computed from the original XML data. We provide an algorithm for query rewriting and show its performance compared with the naive approach, i.e. the approach when query is evaluated over materialized view. We also propose a number of generalizations of possible security policies